G¨odel functional interpretation and weak compactness Ulrich Kohlenbach1 Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstraße 7, 64289 Darmstadt, Germany -darmstadt.d

Source URL: www.mathematik.tu-darmstadt.de

• Mathematics
• Mathematical analysis
• Operator theory
• Computability theory
• Arithmetic function
• Primitive recursive function
• Ergodic theory
• Hilbert space
• Theoretical physics
• Spectral theory of ordinary differential equations
• Differential forms on a Riemann surface

ODD VALUES OF THE PARTITION FUNCTION Ken Ono May 6,1996 Revised version Abstract. Let p(n) denote the number of partitions of an integer n. Recently the author has shown that in any arithmetic progression r (mod t), the

Source URL: www.mathcs.emory.edu

FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Metalogic
• Reverse mathematics
• Primitive recursive functional
• Second-order arithmetic
• Peano axioms
• Primitive recursive function
• Primitive recursive arithmetic
• Model theory
• Symbol

Game characterizations of function classes and Weihrauch degrees MSc Thesis (Afstudeerscriptie) written by Hugo de Holanda Cunha Nobrega (born September 5, 1987 in Petrópolis, Brazil)

Source URL: www.illc.uva.nl

• Mathematical logic
• Mathematics
• Set theory
• Descriptive set theory
• Wadge hierarchy
• Determinacy
• Axiom of countable choice
• Ordinal numbers
• -consistent theory
• Ordinal arithmetic

Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

Source URL: ludovicpatey.com

• Mathematical logic
• Computability theory
• Mathematics
• Theoretical computer science
• Proof theory
• Logic in computer science
• Theory of computation
• Second-order arithmetic
• Combinatory logic
• Reverse mathematics
• Computable function

On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Predicate logic
• Logic in computer science
• Primitive recursive functional
• Reverse mathematics
• Primitive recursive function
• Primitive recursive arithmetic
• First-order logic
• Peano axioms
• Ordinal analysis

PARITY OF THE PARTITION FUNCTION IN ARITHMETIC PROGRESSIONS, II Matthew Boylan and Ken Ono Appearing in the Bulletin of the London Mathematical Society. Abstract. Let p(n) denote the ordinary partition function. Subbarao

Source URL: www.mathcs.emory.edu

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Source URL: ludovicpatey.com

• Computability theory
• Computable function
• Computation in the limit
• Second-order arithmetic
• Compactness theorem
• Reverse mathematics
• 01 class
• PA degree
• Low
• Algorithmically random sequence
• Computable number

Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Mathematical logic
• Mathematics
• Theoretical computer science
• Primitive recursive function
• Primitive recursive arithmetic
• ELEMENTARY
• Reverse mathematics
• Pairing function
• Ackermann function
• Sequence
• Recursion

PARITY OF THE PARTITION FUNCTION Ken Ono Abstract. Let p(n) denote the number of partitions of a non-negative integer n. A well-known conjecture asserts that every arithmetic progression contains infinitely many integer

Source URL: www.mathcs.emory.edu